Pathfinding in Games
نویسندگان
چکیده
Commercial games can be an excellent testbed to artificial intelligence (AI) research, being a middle ground between synthetic, highly abstracted academic benchmarks, and more intricate problems from real life. Among the many AI techniques and problems relevant to games, such as learning, planning, and natural language processing, pathfinding stands out as one of the most common applications of AI research to games. In this document we survey recent work in pathfinding in games. Then we identify some challenges and potential directions for future work. This chapter summarizes the discussions held in the pathfinding workgroup. 1998 ACM Subject Classification I.2.8 Problem Solving, Control Methods, and Search
منابع مشابه
Pathfinding in Computer Games
One of the greatest challenges in the design of realistic Artificial Intelligence (AI) in computer games is agent movement. Pathfinding strategies are usually employed as the core of any AI movement system. This report will highlight pathfinding algorithms used presently in games and their shortcomings especially when dealing with real-time pathfinding. With the advances being made in other com...
متن کاملImproving Heuristics for Pathfinding in Games
Pathfinding is used extensively in modern computer games: more efficient pathfinding allows for more units and bigger games. Several heuristics already exist to improve the performance beyond that of heuristics as the Manhattan distance when used in the A* search algorithm. In this paper, the new Boundary Heuristic (along with several variants) is introduced in order to attempt to increase the ...
متن کاملStrategic Team AI Path Plans: Probabilistic Pathfinding
This paper proposes a novel method to generate strategic team AI pathfinding plans for computer games and simulations using probabilistic pathfinding. This method is inspired by genetic algorithms (Russell and Norvig, 2002), in that, a fitness function is used to test the quality of the path plans. The method generates high-quality path plans by eliminating the low-quality ones. The path plans ...
متن کاملRealistic Agent Movement in Dynamic Game Environments
One of the greatest challenges in the design of realistic Artificial Intelligence (AI) in computer games is agent movement. Pathfinding strategies are usually employed as the core of any AI movement system. This paper examines pathfinding algorithms used presently in games and details their shortcomings. These shortcomings are particularly apparent when pathfinding must be carried out in real-t...
متن کاملA*-based Pathfinding in Modern Computer Games
Pathfinding in computer games has been investigated for many years. It is probably the most popular but frustrating game artificial intelligence (AI) problem in game industry. Various search algorithms, such as Dijkstra’s algorithm, bread first search algorithm and depth first search algorithm, were created to solve the shortest path problem until the emergence of A* algorithm as a provably opt...
متن کامل